Termination of String Rewriting Proved Automatieally

In this paper it is described how a combination of semantic labelling, polynomial interpretations, recursive path order and the dependency pair method can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing these techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by TORPA are easy to read and check, but for many of them finding a termination proof for the same SRS would be a hard job for a human. This paper contains all underlying theory, deBcribes how search for a termination proof is implemented, and includes many examples.